Large sets of disjoint t-designs
نویسندگان
چکیده
[u this paper, we show how the basis reduction algorithm of Kreher and Radziszowski can be used to construct large sets of disjoint designs with specified automorphisms. In particular, we construct a (3,4,23;4)large set which rise to an infinite family of large sets of 4-desiglls via a result of Teirlinck [6].
منابع مشابه
On the Number of Mutually Disjoint Cyclic Designs
We denote by LS[N ](t, k, v) a large set of t-(v, k, λ) designs of size N , which is a partition of all k-subsets of a v-set into N disjoint t-(v, k, λ) designs and N = ( v−t k−t ) /λ. We use the notation N(t, v, k, λ) as the maximum possible number of mutually disjoint cyclic t-(v, k, λ)designs. In this paper we give some new bounds for N(2, 29, 4, 3) and N(2, 31, 4, 2). Consequently we presen...
متن کاملSome Indecomposable t-Designs
The existence of large sets of 5-(14,6,3) designs is in doubt. There are five simple 5-(14,6,6) designs known in the literature. In this note, by the use of a computer program, we show that all of these designs are indecomposable and therefore they do not lead to large sets of 5(14,6,3) designs. Moreover, they provide the first counterexamples for a conjecture on disjoint t-designs which states...
متن کاملRoot cases of large sets of t-designs
A large set of t-(v, k, λ) designs of size N , denoted by LS[N ](t, k, v), is a partition of all k-subsets of a v-set into N disjoint t-(v, k, λ) designs, where N = ( v−t k−t ) /λ. A set of trivial necessary conditions for the existence of an LS[N ](t, k, v) is N ∣
متن کاملFurther results on large sets of disjoint group-divisible designs
Chen, D., CC. Lindner and D.R. Stinson, Further results on large sets of disjoint group-divisible designs, Discrete Mathematics 110 (1992) 35-42. This paper is a continuation of a recent paper by Chen and Stinson, where some recursive constructions for large sets of group-divisible design with block size 3 arc presented. In this paper, we give two new recursive constructions. In particular, we ...
متن کاملA Few More Large Sets of t-Designs
We construct several new large sets of t-designs that are invariant under Frobenius groups, and discuss their consequences. These large sets give rise to further new large sets by means of known recursive constructions including an infinite family of large sets of 3− (v, 4, λ) designs. c © 1998 John Wiley & Sons, Inc. J Combin Designs 6: 293–308, 1998
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 2 شماره
صفحات -
تاریخ انتشار 1990